Ordered vertex removal and subgraph problems
نویسندگان
چکیده
منابع مشابه
Ordered Vertex Removal and Subgraph Problems Vertex Removal and Graph Problems
Several new graph theoretic problems, which arise naturally from existing coloring algorithms, are de ned. The complementary High Degree Vertex Removal Problem and Low Degree Vertex Removal Problem are both shown to be NP-complete. The Low Degree Subgraph Problem is de ned and shown to be NP-complete, whereas, the \complementary" problem for high degree subgraphs was previously shown to be P-co...
متن کاملVertex unique labelled subgraph mining
With the successful development of efficient algorithms for Frequent Subgraph Mining (FSM), this paper extends the scope of subgraph mining by proposing Vertex Unique labelled Subgraph Mining (VULSM). VULSM has a focus on the local properties of a graph and does not require external parameters such as the support threshold used in frequent pattern mining. There are many applications where the m...
متن کاملOrdered Vertex Partitioning
A transitive orientation of a graph is an orientation of the edges that produces a transitive digraph. The modular decomposition of a graph is a canonical representation of all of its modules. Finding a transitive orientation and finding the modular decomposition are in some sense dual problems. In this paper, we describe a simple O(n+mlogn) algorithm that uses this duality to find both a trans...
متن کاملPreprocessing Subgraph and Minor Problems: When Does a Small Vertex Cover Help?
We prove a number of results around kernelization of problems parameterized by the size of a given vertex cover of the input graph. We provide three sets of simple general conditions characterizing problems admitting kernels of polynomial size. Our characterizations not only give generic explanations for the existence of many known polynomial kernels for problems like q-Coloring, Odd Cycle Tran...
متن کاملMinimal Vertex Unique Labelled Subgraph Mining
This paper introduces the concept of Vertex Unique Labelled Subgraph Mining (VULSM), a specialised form of subgraph mining. A VULS is a subgraph defined by a set of edge labels that has a unique vertex labelling associated with it. A minimal VULS is then a VULS which is not a supergraph of any other VULS. The application considered in this paper, for evaluation purposes, is error prediction wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1989
ISSN: 0022-0000
DOI: 10.1016/0022-0000(89)90026-3